Clique immersion in graph products
نویسندگان
چکیده
Let G,H be graphs and G?H represent a particular graph product of G H. We define im(G) to the largest t such that has Kt-immersion ask: given im(G)=t im(H)=r, how large is im(G?H)? Best possible lower bounds are provided when ? Cartesian or lexicographic product, conjecture offered for each direct strong products, along with some partial results.
منابع مشابه
Clique-Relaxed Competitive Graph Coloring
In this paper we investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color α is legal for a vertex if said vertex has no neighbors colored α. Other variations of the game change this definition of a legal color. For a fixed color ...
متن کاملClique numbers of graph unions
Let B and R be two simple graphs with vertex set V , and let G(B, R) be the simple graph with vertex set V , in which two vertices are adjacent if they are adjacent in at least one of B and R. For X ⊆ V , we denote by B|X the subgraph of B induced by X; let R|X and G(B, R)|X be defined similarly. We say that the pair (B, R) is additive if for every X ⊆ V , the sum of the clique numbers of B|X a...
متن کاملClique Minors in Cartesian Products of Graphs
A clique minor in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The Hadwiger number η(G) is the maximum cardinality of a clique minor in G. It is one of the principle measures of the structural complexity of a graph. This paper studies clique minors in the Cartesian product G H. Our main result is a rough structural characteri...
متن کاملParallelizing Clique and Quasi-Clique Detection over Graph Data
In a wide variety of emerging data-intensive applications, such as social network analysis, Web document clustering, entity resolution, and detection of consistently co-expressed genes in systems biology, the detection of dense subgraphs (cliques and approximate or quasi-cliques) is an essential component. Unfortunately, these problems are NP-Complete and thus computationally intensive at scale...
متن کاملGraph Reconstruction in the Congested Clique
The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of n nodes. In this paper we consider the situation where the joint input to the nodes is an nnode labeled graph G, i.e., the local input received by each node is the indicator function of its neighborhood in G. Nodes execute an algorithm, communicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113421